The complixity of McKay's canonical labeling algorithm
نویسنده
چکیده
We study the time complexity of McKay's algorithm to compute canonical forms and automorphism groups of graphs. The algorithm is based on a type of backtrack search, and it performs pruning by discovered auto-morphisms and by hashing partial information of vertex labelings. In practice, the algorithm is implemented in the nauty package. We obtain colorings of F urer's graphs that allow the algorithm to compute their canonical forms in polynomial time. We then prove an exponential lower bound of the algorithm for connected 3-regular graphs of color-class size 4 using F urer's construction. We conducted experiments with nauty for these graphs. Our experimental results also indicate the same exponential lower bound.
منابع مشابه
Terminology of Combining the Sentences of Farsi Language with the Viterbi Algorithm and BI-GRAM Labeling
This paper, based on the Viterbi algorithm, selects the most likely combination of different wording from a variety of scenarios. In this regard, the Bi-gram and Unigram tags of each word, based on the letters forming the words, as well as the bigram and unigram labels After the breakdown into the composition or moment of transition from the decomposition to the combination obtained from th...
متن کاملAn Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملGraph Symmetry Detection and Canonical Labeling: Differences and Synergies
Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by detecting symmetries early and discarding symmetric subproblems. Canonical labeling of combinatorial objects facilitates easy equivalence checking through quick matching. All existing canonical labeling software also finds symmetries, but the fastest symmetry-finding softwar...
متن کاملInterval Graphs: Canonical Representations in Logspace
We present a logspace algorithm for computing a canonical labeling, in fact a canonical interval representation, for interval graphs. To achieve this, we compute canonical interval representations of interval hypergraphs. This approach also yields a canonical labeling of convex graphs. As a consequence, the isomorphism and automorphism problems for these graph classes are solvable in logspace. ...
متن کاملGraphs of Bounded Treewidth can be Canonized in AC
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC [GV06] and further to LogCFL [DTW10]. The computation of canonical forms or a canonical labeling provides more information than isomorphism testing. Whether canonization is in NC or even TC was stated as an open question in [Köb06]. Köbler and Verbitsky [KV08] give a TC canonical labeling al...
متن کامل